Tham khảo Bao lồi

Andrew, A. M. (1979), “Another efficient algorithm for convex hulls in two dimensions”, Information Processing Letters 9 (5): 216–219, doi:10.1016/0020-0190(79)90072-3
Artin, Emil (1967), “2.5. Newton's Polygon”, Algebraic Numbers and Algebraic Functions, Gordon and Breach, tr. 37–43, MR 0237460
Auel, Asher (2019), “The mathematics of Grace Murray Hopper” (PDF), Notices of the American Mathematical Society 66 (3): 330–340, MR 3889348
Avis, David; Bremner, David; Seidel, Raimund (1997), “How good are convex hull algorithms?”, Computational Geometry 7 (5-6): 265–301, MR 1447243, doi:10.1016/S0925-7721(96)00023-5
Bárány, Imre; Katchalski, Meir; Pach, János (1982), “Quantitative Helly-type theorems”, Proceedings of the American Mathematical Society 86 (1): 109–114, MR 663877, doi:10.2307/2044407
Basch, Julien; Guibas, Leonidas J.; Hershberger, John (1999), “Data structures for mobile data”, Journal of Algorithms 31 (1): 1–28, MR 1670903, doi:10.1006/jagm.1998.0988
Birkhoff, Garrett (1935), “Integration of functions with values in a Banach space”, Transactions of the American Mathematical Society 38 (2): 357–378, MR 1501815, doi:10.2307/1989687
Brown, K. Q. (1979), “Voronoi diagrams from convex hulls”, Information Processing Letters 9 (5): 223–228, doi:10.1016/0020-0190(79)90074-7
de Berg, Mark; van Kreveld, Marc; Overmars, Mark; Schwarzkopf, Otfried (2008), Computational Geometry: Algorithms and Applications (ấn bản 3), Springer, ISBN 978-3-540-77973-5
Chan, Timothy M. (2012), “Three problems about dynamic convex hulls”, International Journal of Computational Geometry and Applications 22 (4): 341–364, MR 2994585, doi:10.1142/S0218195912600096
Chang, J. S.; Yap, C.-K. (1986), “A polynomial solution for the potato-peeling problem”, Discrete & Computational Geometry 1 (2): 155–182, MR 834056, doi:10.1007/BF02187692
Chazelle, Bernard (1985), “On the convex layers of a planar set”, IEEE Transactions on Information Theory 31 (4): 509–517, MR 798557, doi:10.1109/TIT.1985.1057060
Chazelle, Bernard (1993), “An optimal convex hull algorithm in any fixed dimension” (PDF), Discrete & Computational Geometry 10 (1): 377–409, doi:10.1007/BF02573985
Chen, Qinyu; Wang, Guozhao (tháng 3 năm 2003), “A class of Bézier-like curves”, Computer Aided Geometric Design 20 (1): 29–39, doi:10.1016/s0167-8396(03)00003-7
Cranston, M.; Hsu, P.; March, P. (1989), “Smoothness of the convex hull of planar Brownian motion”, Annals of Probability 17 (1): 144–150, JSTOR 2244202, MR 972777
Demaine, Erik D.; Gassend, Blaise; O'Rourke, Joseph; Toussaint, Godfried T. (2008), “All polygons flip finitely ... right?”, Surveys on Discrete and Computational Geometry, Contemporary Mathematics 453, Providence, Rhode Island: American Mathematical Society, tr. 231–255, MR 2405683, doi:10.1090/conm/453/08801
Dines, Lloyd L. (1938), “On convexity”, American Mathematical Monthly 45 (4): 199–209, JSTOR 2302604, MR 1524247, doi:10.2307/2302604
Dirnböck, Hans; Stachel, Hellmuth (1997), “The development of the oloid” (PDF), Journal for Geometry and Graphics 1 (2): 105–118, MR 1622664
Edelsbrunner, Herbert; Kirkpatrick, David G.; Seidel, Raimund (1983), “On the shape of a set of points in the plane”, IEEE Transactions on Information Theory 29 (4): 551–559, doi:10.1109/TIT.1983.1056714
Epstein, David B. A.; Marden, Albert (1987), “Convex hulls in hyperbolic space, a theorem of Sullivan, and measured pleated surfaces”, trong Epstein, David B. A., Analytical and geometric aspects of hyperbolic space (Coventry/Durham, 1984), London Mathematical Society Lecture Note Series 111, Cambridge: Cambridge University Press, tr. 113–253, MR 903852
Escobar, Laura; Kaveh, Kiumars (tháng 9 năm 2020), “Convex polytopes, algebraic geometry, and combinatorics” (PDF), Notices of the American Mathematical Society 67 (8): 1116–1123
Gardner, L. Terrell (1984), “An elementary proof of the Russo-Dye theorem”, Proceedings of the American Mathematical Society 90 (1): 171, MR 722439, doi:10.2307/2044692
Gel'fand, Israel M.; Kapranov, Mikhail M.; Zelevinsky, Andrei V. (1994), “6. Newton Polytopes and Chow Polytopes”, Discriminants, Resultants, and Multidimensional Determinants, Mathematics: Theory & Applications, Birkhäuser, tr. 193–213, ISBN 0-8176-3660-9, MR 1264417, doi:10.1007/978-0-8176-4771-1
Getz, Wayne M.; Wilmers, Christopher C. (2004), “A local nearest-neighbor convex-hull construction of home ranges and utilization distributions” (PDF), Ecography (Wiley) 27 (4): 489–505, doi:10.1111/j.0906-7590.2004.03835.x, Bản gốc (PDF) lưu trữ ngày 23 tháng 4 năm 2005
Graham, Ronald L.; Yao, F. Frances (1983), “Finding the convex hull of a simple polygon”, Journal of Algorithms 4 (4): 324–331, MR 729228, doi:10.1016/0196-6774(83)90013-5
Grünbaum, Branko (2003), Convex Polytopes, Graduate Texts in Mathematics 221 (ấn bản 2), Springer, ISBN 978-0-387-00424-2
Gustin, William (1947), “On the interior of the convex hull of a Euclidean set”, Bulletin of the American Mathematical Society 53: 299–301, MR 20800, doi:10.1090/S0002-9904-1947-08787-5
Harris, Bernard (1971), “Mathematical models for statistical decision theory” (PDF), Optimizing methods in statistics (Proc. Sympos., Ohio State Univ., Columbus, Ohio, 1971), tr. 369–389, MR 0356305
Herrlich, Horst (1992), “Hyperconvex hulls of metric spaces”, Proceedings of the Symposium on General Topology and Applications (Oxford, 1989), Topology and its Applications 44 (1-3): 181–187, MR 1173256, doi:10.1016/0166-8641(92)90092-E
Johnson, Charles R. (1976), “Normality and the numerical range”, Linear Algebra and its Applications 15 (1): 89–94, MR 460358, doi:10.1016/0024-3795(76)90080-x
Kashiwabara, Kenji; Nakamura, Masataka; Okamoto, Yoshio (2005), “The affine representation theorem for abstract convex geometries”, Computational Geometry 30 (2): 129–144, MR 2107032, doi:10.1016/j.comgeo.2004.05.001
Katoh, Naoki (1992), “Bicriteria network optimization problems”, IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, E75-A: 321–329
Kernohan, Brian J.; Gitzen, Robert A.; Millspaugh, Joshua J. (2001), “Analysis of animal space use and movements”, trong Millspaugh, Joshua; Marzluff, John M., Radio Tracking and Animal Populations, Academic Press, ISBN 978-0-12-497781-5
Kirkpatrick, K. A. (2006), “The Schrödinger–HJW theorem”, Foundations of Physics Letters 19 (1): 95–102, arXiv:quant-ph/0305068, doi:10.1007/s10702-006-1852-1
Kiselman, Christer O. (2002), “A semigroup of operators in convexity theory”, Transactions of the American Mathematical Society 354 (5): 2035–2053, MR 1881029, doi:10.1090/S0002-9947-02-02915-X
Knuth, Donald E. (1992), Axioms and Hulls, Lecture Notes in Computer Science 606, Heidelberg: Springer-Verlag, ISBN 3-540-55611-7, MR 1226891, doi:10.1007/3-540-55611-7
Kőnig, Dénes (tháng 12 năm 1922), “Über konvexe Körper”, Mathematische Zeitschrift 14 (1): 208–210, doi:10.1007/bf01215899 ; xem thêm bình duyệt của Hans Rademacher (1922)
Krein, Mark; Milman, David (1940), “On extreme points of regular convex sets”, Studia Mathematica 9: 133–138
Krein, Mark; Šmulian, V. (1940), “On regularly convex sets in the space conjugate to a Banach space”, Annals of Mathematics, Second Series 41: 556–583, JSTOR 1968735, MR 2009, doi:10.2307/1968735
Laurentini, A. (1994), “The visual hull concept for silhouette-based image understanding”, IEEE Transactions on Pattern Analysis and Machine Intelligence 16 (2): 150–162, doi:10.1109/34.273735
Lay, Steven R. (1982), Convex Sets and their Applications, John Wiley & Sons, ISBN 0-471-09584-2, MR 655598
Lee, Der-Tsai (1983), “On finding the convex hull of a simple polygon”, International Journal of Computer and Information Sciences 12 (2): 87–98, MR 724699, doi:10.1007/BF00993195
Mason, Herbert B. (1908), Encyclopaedia of Ships and Shipping, tr. 698
McCallum, Duncan; Avis, David (1979), “A linear algorithm for finding the convex hull of a simple polygon”, Information Processing Letters 9 (5): 201–206, MR 552534, doi:10.1016/0020-0190(79)90069-3
Newton, Isaac (24 tháng 10 năm 1676), “Letter to Henry Oldenburg”, The Newton Project (Đại học Oxford), Bản gốc lưu trữ ngày 10 tháng 8 năm 2017
Nicola, Piercarlo (2000), “General Competitive Equilibrium”, Mainstream Mathematical Economics in the 20th Century, Springer, tr. 197–215, doi:10.1007/978-3-662-04238-0_16
Nilsen, Erlend B.; Pedersen, Simen; Linnell, John D. C. (2008), “Can minimum convex polygon home ranges be used to draw biologically meaningful conclusions?”, Ecological Research 23 (3): 635–639, doi:10.1007/s11284-007-0421-9
Oberman, Adam M. (2007), “The convex envelope is the solution of a nonlinear obstacle problem”, Proceedings of the American Mathematical Society 135 (6): 1689–1694, MR 2286077, doi:10.1090/S0002-9939-07-08887-9
Okon, T. (2000), “Choquet theory in metric spaces”, Zeitschrift für Analysis und ihre Anwendungen 19 (2): 303–314, MR 1768994, doi:10.4171/ZAA/952
Ottmann, T.; Soisalon-Soininen, E.; Wood, Derick (1984), “On the definition and computation of rectilinear convex hulls”, Information Sciences 33 (3): 157–171, doi:10.1016/0020-0255(84)90025-2
Prasolov, Victor V. (2004), “1.2.1 The Gauss–Lucas theorem”, Polynomials, Algorithms and Computation in Mathematics 11, Springer, tr. 12–13, ISBN 3-540-40714-6, MR 2082772, doi:10.1007/978-3-642-03980-5
Pulleyblank, William R. (1983), “Polyhedral combinatorics”, trong Bachem, Achim; Korte, Bernhard; Grötschel, Martin, Mathematical Programming: The State of the Art (XIth International Symposium on Mathematical Programming, Bonn 1982), Springer, tr. 312–345, doi:10.1007/978-3-642-68874-4_13
Rappoport, Ari (1992), “An efficient adaptive algorithm for constructing the convex differences tree of a simple polygon”, Computer Graphics Forum 11 (4): 235–240, doi:10.1111/1467-8659.1140235
Reay, John R. (1979), “Several generalizations of Tverberg's theorem”, Israel Journal of Mathematics 34 (3): 238–244 (1980), MR 570883, doi:10.1007/BF02760885
Rieffel, Eleanor G.; Polak, Wolfgang H. (2011), Quantum Computing: A Gentle Introduction, MIT Press, tr. 215–216, ISBN 978-0-262-01506-6
Rockafellar, R. Tyrrell (1970), Convex Analysis, Princeton Mathematical Series 28, Princeton, N.J.: Princeton University Press, MR 0274683
Rossi, Hugo (1961), “Holomorphically convex sets in several complex variables”, Annals of Mathematics, Second Series 74: 470–493, JSTOR 1970292, MR 133479, doi:10.2307/1970292
Rousseeuw, Peter J.; Ruts, Ida; Tukey, John W. (1999), “The bagplot: A bivariate boxplot”, The American Statistician 53 (4): 382–387, doi:10.1080/00031305.1999.10474494
Sakuma, Itsuo (1977), “Closedness of convex hulls”, Journal of Economic Theory 14 (1): 223–227, doi:10.1016/0022-0531(77)90095-3
Schneider, Rolf (1993), Convex Bodies: The Brunn–Minkowski Theory, Encyclopedia of Mathematics and its Applications 44, Cambridge: Cambridge University Press, ISBN 0-521-35220-7, MR 1216521, doi:10.1017/CBO9780511526282
Seaton, Katherine A. (2017), “Sphericons and D-forms: a crocheted connection”, Journal of Mathematics and the Arts 11 (4): 187–202, MR 3765242, arXiv:1603.08409, doi:10.1080/17513472.2017.1318512
Sedykh, V. D. (1981), “Structure of the convex hull of a space curve”, Trudy Seminara imeni I. G. Petrovskogo (6): 239–256, MR 630708 , dịch lại trong Sedykh, V. D. (1986), “Structure of the convex hull of a space curve”, Journal of Soviet Mathematics 33 (4): 1140–1153, doi:10.1007/BF01086114
Sontag, Eduardo D. (1982), “Remarks on piecewise-linear algebra”, Pacific Journal of Mathematics 98 (1): 183–201, MR 644949
Steinitz, Ernst (1914), “Bedingt konvergente Reihen und konvexe Systeme. (Fortsetzung)”, Journal für die Reine und Angewandte Mathematik 144: 1–40, MR 1580890, doi:10.1515/crll.1914.144.1
Talman, Louis A. (1977), “Fixed points for condensing multifunctions in metric spaces with convex structure”, Kōdai Mathematical Seminar Reports 29 (1-2): 62–70, MR 463985
Toussaint, Godfried (1983), “Solving geometric problems with the rotating calipers”, Proceedings of IEEE MELECON '83, Athens
Toussaint, Godfried (1986), “An optimal algorithm for computing the relative convex hull of a set of points in a polygon”, Proceedings of EURASIP, Signal Processing III: Theories and Applications, Part 2 (PDF), North-Holland, tr. 853–856
Weeks, Jeffrey R. (1993), “Convex hulls and isometries of cusped hyperbolic 3-manifolds”, Topology and Its Applications 52 (2): 127–149, MR 1241189, doi:10.1016/0166-8641(93)90032-9
Westermann, L. R. J. (1976), “On the hull operator”, Indagationes Mathematicae 38 (2): 179–184, MR 0404097, doi:10.1016/1385-7258(76)90065-2
White, F. Puryer (tháng 4 năm 1923), “Pure mathematics”, Science Progress in the Twentieth Century 17 (68): 517–526, JSTOR 43432008
Whitley, Robert (1986), “The Kreĭn-Šmulian theorem”, Proceedings of the American Mathematical Society 97 (2): 376–377, MR 835903, doi:10.2307/2046536
Williams, Jason; Rossignac, Jarek (2005), “Tightening: curvature-limiting morphological simplification”, trong Kobbelt, Leif; Shapiro, Vadim, Proceedings of the Tenth ACM Symposium on Solid and Physical Modeling 2005, Cambridge, Massachusetts, USA, June 13-15, 2005, ACM, tr. 107–112, doi:10.1145/1060244.1060257
Worton, Bruce J. (1995), “A convex hull-based estimator of home-range size”, Biometrics 51 (4): 1206–1215, JSTOR 2533254, doi:10.2307/2533254